Metric Transforms and Euclidean Embeddings
نویسندگان
چکیده
It is proved that if 0 < c < 0.72/« then for any «-point metric space (X, d), the metric space (X,dc) is isometrically embeddable into a Euclidean space. For 6-point metric space, c = j log2 | is the largest exponent that guarantees the existence of isometric embeddings into a Euclidean space. Such largest exponent is also determined for all «-point graphs with "truncated distance".
منابع مشابه
Distance Covariance in Metric Spaces
We extend the theory of distance (Brownian) covariance from Euclidean spaces, where it was introduced by Székely, Rizzo and Bakirov, to general metric spaces. We show that for testing independence, it is necessary and sufficient that the metric space be of strong negative type. In particular, we show that this holds for separable Hilbert spaces, which answers a question of Kosorok. Instead of t...
متن کاملFast binary embeddings, and quantized compressed sensing with structured matrices
This paper deals with two related problems, namely distance-preserving binary embeddings and quantization for compressed sensing . First, we propose fast methods to replace points from a subset X ⊂ Rn, associated with the Euclidean metric, with points in the cube {±1}m and we associate the cube with a pseudo-metric that approximates Euclidean distance among points in X . Our methods rely on qua...
متن کاملWord Re-Embedding via Manifold Dimensionality Retention
Word embeddings seek to recover a Euclidean metric space by mapping words into vectors, starting from words cooccurrences in a corpus. Word embeddings may underestimate the similarity between nearby words, and overestimate it between distant words in the Euclidean metric space. In this paper, we re-embed pre-trained word embeddings with a stage of manifold learning which retains dimensionality....
متن کاملAssessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation
Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...
متن کاملGreedy Embeddings, Trees, and Euclidean vs. Lobachevsky Geometry
A greedy embedding of an unweighted undirected graph G = (V, E) into a metric space (X, ρ) is a function f : V → X such that for every source-sink pair of different vertices s, t ∈ V it is the case that s has a neighbor v in G with ρ(f(v), f(t)) < ρ(f(s), f(t)). Finding greedy embeddings of connectivity graphs helps to build distributed routing schemes with compact routing tables. In this paper...
متن کامل